beta reduction การใช้

• Beta reduction of this lambda term never reaches normal form.
• If no variable names are bound in the body, beta reduction may be performed on the lambda abstraction without canonical renaming.
• For the programmer, it means that the beta reduction of the lambda term will loop forever, never reaching a normal form.
• Through a ( modified ) form of functional application ( or beta reduction ), the focus part of ( 10 ) and ( 11 ) is projected up through the syntax to the sentential level.
• Structural proof theory is connected to type theory by means of the Curry-Howard correspondence, which observes a structural analogy between the process of normalisation in the natural deduction calculus and beta reduction in the typed lambda calculus.
• ;Lambda calculus : A computation consists of an initial lambda expression ( or two if you want to separate the function and its input ) plus a finite sequence of lambda terms, each deduced from the preceding term by one application of Beta reduction.
• This example is similar to the Scheme expression " ( ( lambda ( x ) ( x x ) ) ( lambda ( x ) ( x x ) ) ) ", which is expanded to itself by beta reduction, and so its evaluation loops indefinitely despite the lack of explicit looping constructs.